PP is Closed Under Truth-Table Reductions
نویسندگان
چکیده
Beigel, Reingold and Spielman 2] showed that PP is closed under intersection and a variety of special cases of polynomial-time truth-table closure. We extend the techniques in 2] to show PP is closed under general polynomial-time truth-table reductions. We also show that PP is closed under constant-round truth-table reductions.
منابع مشابه
Circuits over PP and PL 1
Wilson's (1985, J. Comput. System. Sci. 31, 169 181) model of oracle gates provides a framework for considering reductions whose strength is intermediate between truth-table and Turing. Improving on a stream of previously published results, we prove that PL and PP are closed under NC1 reductions. This answers an open problem of Ogihara (1996, ``Proc. 37th Ann. IEEE Symp. Found. Computer Sci.'')...
متن کاملProbabilistic Polynomial Time is Closed under Parity Reductions
We show that probabilistic polynomial time (PP) is closed under polynomial-time parity reductions. As corollaries, we show that several complexity classes are contained in PP. Results Comparing the power of various computational paradigms is a central concern of computational complexity theory. In this paper, we study the power of PP by asking whether it is closed downwards under polynomial-tim...
متن کاملCircuits Over PP and PL
Wilson’s [19] model of oracle gates provides a framework for considering reductions whose strength is intermediate between truth-table and Turing. Improving on a stream of results by Beigel, Reingold, Spielman, Fortnow, and Ogihara [6, 9, 14], we prove that PL and PP are closed under NC1 reductions. This answers an open problem of Ogihara [14]. More generally, we show that NC k+1 = AC k and NC ...
متن کاملPP Is Closed under Intersection
In his seminal paper on probabilistic Turing machines, Gill 13] asked whether the class PP is closed under intersection and union. We give a positive answer to this question. We also show that PP is closed under a variety of polynomial-time truth-table reductions. Consequences in complexity theory include the deenite collapse and (assuming P 6 = PP) separation of certain query hierarchies over ...
متن کاملClosure of Polynomial Time Partial Information Classes under Polynomial Time Reductions
Polynomial time partial information classes are extensions of the class P of languages decidable in polynomial time. A partial information algorithm for a language A computes, for fixed n ∈ N, on input of words x1, . . . , xn a set P of bitstrings, called a pool, such that χA(x1, . . . , xn) ∈ P , where P is chosen from a family D of pools. A language A is in P[D], if there is a polynomial time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 124 شماره
صفحات -
تاریخ انتشار 1991